Linear list coloring of some sparse graph
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولList-Coloring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs and show that the choosability χ`(G 2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ`(G 2) is at most five if d < 7/3 ...
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملList-coloring the square of a subcubic graph
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph G with maximum degree ∆(G) = 3 we have χ(G2) ≤ 7. Kostochka and Woodall conjectured that for every graph, the list-chromatic number of G2 equals the chromatic number of G2, that is χl(G 2) = χ(G2) for all G. If true, t...
متن کاملList strong edge coloring of some classes of graphs
A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index of a graph is the minimum number of colors needed to obtain a strong edge coloring. In an analogous way, we can define the list version of strong edge coloring and list version of strong chromatic index. In this paper we prove that if G is a graph with maximu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2169